Efficient Updates of Bounding Sphere Hierarchies for Geometrically Deformable Models

نویسندگان

  • Jonas Spillmann
  • Markus Becker
  • Matthias Teschner
چکیده

We present a new approach for efficient collision handling of meshless objects undergoing geometric deformation. The presented technique is based on bounding sphere hierarchies. We show that information of the geometric deformation model can be used to significantly accelerate the hierarchy update. The cost of the presented hierarchy update depends on the number of primitives in close proximity, but not on the total number of primitives. Further, the hierarchical collision detection is combined with a level-of-detail response scheme. Since the collision response can be performed on any level of the hierarchy, it allows for balancing accuracy and efficiency. Thus, the collision handling scheme is particularly useful for time-critical applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strategies for Bounding Volume Hierarchy Updates for Ray Tracing of Deformable Models

In this paper, we describe strategies for bounding volume hierarchy updates for ray tracing of deformable models. By using pre-built hierarchy structures and a lazy evaluation technique for updating the bounding volumes, the hierarchy reconstruction can be made very efficiently. Experiments show that for deforming triangle meshes the reconstruction time of the bounding volume hierarchies per fr...

متن کامل

Adaptive Bounding Volume Hierarchies for Efficient Collision Queries

The need for efficient interference detection frequently arises in computer graphics, robotics, virtual prototyping, surgery simulation, computer games, and visualization. To prevent bodies passing directly through each other, the simulation system must be able to track touching or intersecting geometric primitives. In interactive simulations, in which millions of geometric primitives may be in...

متن کامل

Collision Detection in Densely Packed Fiber Assemblies with Application to Hair Modeling

In this paper we investigate the application of bounding volume hierarchies in collision detection among densely packed fiber assemblies like hair strands or cable looms. In particular, we glance at collision detection algorithms with sub-quadratic upper bound and their practicability and performance in complex dynamic hair scenes. Unlike common collision detection techniques our approach explo...

متن کامل

Kinetic Bounding Volume Hierarchies for Collision Detection of Deformable Objects

We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AABB tree and the kinetic BoxTree. The event-based approach of the kinetic data structures framework enables us to show that our algorithms are optimal in the number of updates. Moreover, we show a lower bound for the tot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Visual Communication and Image Representation

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2006